We study the problem of k-visibility in the memoryconstrained model. In this model, the input resides in a randomly accessible read-only memory of O(n) words with O(log n) bits each. An algorithm can read and write O(s) additional words of workspace during its execution, and it writes its output to write-only memory. In a given polygon P , for a given point q ∈ P , we say a point p is inside th...

We study the problem of computing the k-visibility region in the memory-constrained model. In this model, the input resides in a randomly accessible read-only memory of O(n) words, with O(logn) bits each. An algorithm can read and write O(s) additional words of workspace during its execution, and it writes its output to write-only memory. In a given polygon P and for a given point q ∈ P , we sa...

Testing two-port memories requires the use of single-port tests as well as special two-port tests; the test strategy determines which tests to be used. Many two-port memories have ports which are read-only or write-only; this impacts the possible fault models, the tests for single-port and two-port memories, as well as the test strategy. This paper presents a test strategy for two-port memories...

If these statements are taken literally (which the theory allows us to do), they imply that God modified the design of the universe after the Fall (cf. Rom. 8:20−22). If he carried this through consistently, so that all parts of the universe conformed to the new design, then, after the Curse, the universe would again have been a going concern, and would again have appeared to have a history tha...

[no abstract available]

Testing two-port memories requires the use of single-port tests as well as special two-port tests; the test strategy determines which tests have to be used. Many two-port memories have ports which are read-only or write-only; this impacts the possible tests for single-port and two-port memories, as well as the test strategy. This paper discusses the consequences of the port restrictions (read-o...